Efficient Vertical Mining of Frequent Closures and Generators
Identifieur interne : 003962 ( Main/Exploration ); précédent : 003961; suivant : 003963Efficient Vertical Mining of Frequent Closures and Generators
Auteurs : Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France] ; Robert Godin [Canada]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
English descriptors
Abstract
Abstract: The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few miners address both concerns, typically by applying levelwise breadth-first traversal. As depth-first traversal is known to be superior, we examine here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one, Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.
Url:
DOI: 10.1007/978-3-642-03915-7_34
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001454
- to stream Istex, to step Curation: 001437
- to stream Istex, to step Checkpoint: 000A69
- to stream Hal, to step Corpus: 001E87
- to stream Hal, to step Curation: 001E87
- to stream Hal, to step Checkpoint: 002A86
- to stream Main, to step Merge: 003A40
- to stream Main, to step Curation: 003962
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Vertical Mining of Frequent Closures and Generators</title><author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name></author><author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></author><author><name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:584BEB08620718EBF1BEB42CF3252F55DCD2EC0E</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1007/978-3-642-03915-7_34</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-GDTPN2GN-0/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001454</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001454</idno><idno type="wicri:Area/Istex/Curation">001437</idno><idno type="wicri:Area/Istex/Checkpoint">000A69</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000A69</idno><idno type="wicri:doubleKey">0302-9743:2009:Szathmary L:efficient:vertical:mining</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:inria-00618805</idno><idno type="url">https://hal.inria.fr/inria-00618805</idno><idno type="wicri:Area/Hal/Corpus">001E87</idno><idno type="wicri:Area/Hal/Curation">001E87</idno><idno type="wicri:Area/Hal/Checkpoint">002A86</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002A86</idno><idno type="wicri:Area/Main/Merge">003A40</idno><idno type="wicri:Area/Main/Curation">003962</idno><idno type="wicri:Area/Main/Exploration">003962</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Efficient Vertical Mining of Frequent Closures and Generators</title><author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name><affiliation wicri:level="3"><country xml:lang="fr">Canada</country><wicri:regionArea>Dépt. d’Informatique UQAM, C.P. 8888, Succ. Centre-Ville, H3C 3P8, Montréal</wicri:regionArea><placeName><settlement type="city">Montréal</settlement><region type="state">Québec</region></placeName></affiliation><affiliation></affiliation></author><author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name><affiliation wicri:level="3"><country xml:lang="fr">Canada</country><wicri:regionArea>Dépt. d’Informatique UQAM, C.P. 8888, Succ. Centre-Ville, H3C 3P8, Montréal</wicri:regionArea><placeName><settlement type="city">Montréal</settlement><region type="state">Québec</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Canada</country></affiliation></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA UMR 7503, B.P. 239, 54506, Vandœuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name><affiliation wicri:level="3"><country xml:lang="fr">Canada</country><wicri:regionArea>Dépt. d’Informatique UQAM, C.P. 8888, Succ. Centre-Ville, H3C 3P8, Montréal</wicri:regionArea><placeName><settlement type="city">Montréal</settlement><region type="state">Québec</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Canada</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>data mining</term><term>frequent itemset mining</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The effective construction of many association rule bases requires the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, only few miners address both concerns, typically by applying levelwise breadth-first traversal. As depth-first traversal is known to be superior, we examine here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one, Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.</div></front></TEI><affiliations><list><country><li>Canada</li><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li><li>Québec</li></region><settlement><li>Montréal</li><li>Vandœuvre-lès-Nancy</li></settlement></list><tree><country name="Canada"><region name="Québec"><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name></region><name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name><name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name></country><country name="France"><region name="Grand Est"><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></region><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003962 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 003962 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:584BEB08620718EBF1BEB42CF3252F55DCD2EC0E
|texte= Efficient Vertical Mining of Frequent Closures and Generators
}}
| This area was generated with Dilib version V0.6.33. |  |